Exact approximations to Stone–Čech compactification
نویسندگان
چکیده
منابع مشابه
Exact Approximations of omega Numbers
A Chaitin Omega number is the halting probability of a universal prefix-free Turing machine. Every Omega number is simultaneously computably enumerable (the limit of a computable, increasing, converging sequence of rationals), and algorithmically random (its binary expansion is an algorithmic random sequence), hence uncomputable. The value of an Omega number is highly machine-dependent. In gene...
متن کاملA complete algorithm to find exact minimal polynomial by approximations
We present a complete algorithm for finding an exact minimal polynomial from its approximate value by using an improved parameterized integer relation construction method. Our result is superior to the existence of error controlling on obtaining an exact rational number from its approximation. The algorithm is applicable for finding exact minimal polynomial of an algebraic number by its approxi...
متن کاملGenerating Exact Approximations to Model Check Concurrent Systems
In this paper, we present a method to generate abstractions for model checking concurrent systems. A program using a defined syntax and semantics, first describes the concurrent system that can be infinite. This program is abstracted using the framework of abstract interpretation where an abstract function will be given. This abstract program is demonstrated to be an accurate approximation of t...
متن کاملApproximations to the exact exchange potential : KLI versus semilocal
In the search for an accurate and computationally efficient approximation to the exact exchange potential of Kohn-Sham density functional theory, we recently compared various semilocal exchange potentials to the exact one [F. Tran et al., Phys. Rev. B 91, 165121 (2015)]. It was concluded that the Becke-Johnson (BJ) potential is a very good starting point, but requires the use of empirical param...
متن کاملNew tight approximations for Fisher's exact test
Fisher’s exact test is often a preferred method to estimate the significance of statistical dependence. However, in large data sets the test is usually too worksome to be applied, especially in an exhaustive search (data mining). The traditional solution is to approximate the significance with the χ-measure, but the accuracy is often unacceptable. As a solution, we introduce a family of upper b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2007
ISSN: 0168-0072
DOI: 10.1016/j.apal.2006.12.004